SIMPLIPOLY: Curvature-based polygonal curve simplification
نویسندگان
چکیده
A curvature-based algorithm to simplify a polygonal curve is described, together with its implementation. The so-called SimpliPoly algorithm uses Bézier curves to approximate pieces of the input curve, and assign curvature estimates to vertices of the input polyline from curvature values computed for the Bézier approximations. The implementation of SimpliPoly is interactive and available freely on-line. Empirical comparisons indicate that SimpliPoly performs as well as the widely-used Douglas-Peucker algorithm in most situations, and significantly better, because it is curvature-driven, in applications where it is necessary to preserve local features
منابع مشابه
Knots and Their Curvatures
I discuss an old result of John Milnor stating roughly that if a closed curve in space is not too curved then it cannot be knotted. CONTENTS 1. The total curvature of a polygonal curve 1 2. A probabilistic interpretation of the total curvature 2 3. The total curvature of a smooth closed curve 4 4. Total curvature and knotting 6 References 7 1. THE TOTAL CURVATURE OF A POLYGONAL CURVE An (orient...
متن کاملAnalytical and Numerical Aspects on Motion of Polygonal Curves with Constant Area Speed
The first purpose of this paper is to propose a formulation of general area-preserving motion of polygonal curves by using a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to admissible class used in the so-called crystalline curvature flow. Actually, if the initial curve is a convex polygon, then our polygonal flow is nothing but the crystall...
متن کاملAsymptotically Optimal and Liner-time Algorithm for Polygonal Curve Simplification
In many application domains involving shapes and curves, polygonal curve simplification is an important part of the computer analysis processes. In this work, we have developed asymptotically optimal and linear-time algorithms to approximate a polygonal curve by another polygonal curve whose vertices are a subset of the vertices of the original one. The algorithm developed in this paper can be ...
متن کاملError term in pointwise approximation of the curvature of a curve
.Let P be a polygonal line approximating a planar curve curve Γ, the discrete curvature kd(P) at a vertex P ∈ P is (usually) defined to be the quotient of the angle between the normals of the two segments with vertex P by the average length of these segments. In this article we give an explicit upper bound of the difference |k(P)− kd(P)| between the curvature k(P) at P of the curve and the disc...
متن کاملA Discrete Spring Model to Generate Fair Curves and Surfaces
To generate fair curves and surfaces is an important tool in the area of computer graphics (CG), computer-aided design (CAD), and other geometric modeling applications. In this paper, we present an iteration-based algorithm to generate fair polygonal curves and surfaces that is based on a new discrete spring model. In the spring model, a linear spring, which length approximately represents a cu...
متن کامل